منابع مشابه
Ordering Constraints on Discourse Relations
Recent work investigates the ordering constraints discourse relations impose on texts. Wolf and Gibson (2003) generated GraphBank, a discourse-annotated corpus without a prior constraint to tree-structured annotations, showing that naive annotators generate representations containing multiple-parented nodes and relations with crossing arguments. Webber et al. (2003) hypothesize that discourse m...
متن کاملDeriving Laws from Ordering Relations
The effect of Richard T. Cox’s contribution to probability theory was to generalize Boolean implication among logical statements to degrees of implication, which are manipulated using rules derived from consistency with Boolean algebra. These rules are known as the sum rule, the product rule and Bayes’ Theorem, and the measure resulting from this generalization is probability. In this paper, I ...
متن کاملDobiński relations and ordering of boson operators
We introduce a generalization of the Dobiński relation, through which we define a family of Bell-type numbers and polynomials. Such generalized Dobiński relations are coherent state matrix elements of expressions involving boson ladder operators. This may be used in order to obtain normally ordered forms of polynomials in creation and annihilation operators, both if the latter satisfy canonical...
متن کاملAn Ordering of Convex Topological Relations
Topological relativity is a concept of interest in geographic information theory. One way of assessing the importance of topology in spatial reasoning is to analyze commonplace terms from natural language relative to conceptual neighborhood graphs, the alignment structures of choice for topological relations. Sixteen English-language spatial prepositions for regionregion relations were analyzed...
متن کاملStochastic ordering of classical discrete distributions
For several pairs (P,Q) of classical distributions on N0, we show that their stochastic ordering P ≤st Q can be characterized by their extreme tail ordering equivalent to P ({k∗})/Q({k∗}) ≤ 1 ≤ limk→k∗ P ({k})/Q({k}), with k∗ and k∗ denoting the minimum and the supremum of the support of P + Q, and with the limit to be read as P ({k∗})/Q({k∗}) for k∗ finite. This includes in particular all pair...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1983
ISSN: 0012-365X
DOI: 10.1016/0012-365x(83)90015-8